By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 6, Issue 4, pp. 607-758

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Internal Fragmentation in a Class of Buddy Systems

David L. Russell

pp. 607-621

BibTeX  Abstract Full Text:  PDF

A New Algorithm for Minimum Cost Binary Trees

Adriano M. Garsia and Michelle L. Wachs

pp. 622-642

BibTeX  Abstract Full Text:  PDF

Determining the Stability Number of a Graph

V. Chvátal

pp. 643-662

BibTeX  Abstract Full Text:  PDF

Minimizing Garbage Collection as a Function of Region Size

Richard G. Larson

pp. 663-668

BibTeX  Abstract Full Text:  PDF

On the Worst-Case Behavior of String-Searching Algorithms

Ronald L. Rivest

pp. 669-674

BibTeX  Abstract Full Text:  PDF

Computational Complexity of Probabilistic Turing Machines

John Gill

pp. 675-695

BibTeX  Abstract Full Text:  PDF

A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem

John S. Carson and Averill M. Law

pp. 696-699

BibTeX  Abstract Full Text:  PDF

A Unified Treatment of Discrete Fast Unitary Transforms

Bernard J. Fino and V. Ralph Algazi

pp. 700-717

BibTeX  Abstract Full Text:  PDF

Prospects and Limitations of Automatic Assertion Generation for Loop Programs

Jayadev Misra

pp. 718-729

BibTeX  Abstract Full Text:  PDF

An Analysis of a Good Algorithm for the Subtree Problem

Steven W. Reyner

pp. 730-732

BibTeX  Abstract Full Text:  PDF

On Relating Time and Space to Size and Depth

Allan Borodin

pp. 733-744

BibTeX  Abstract Full Text:  PDF

Generating Binary Trees Lexicographically

F. Ruskey and T. C. Hu

pp. 745-758

BibTeX  Abstract Full Text:  PDF